Testing polycyclicity of finitely generated rational matrix groups
نویسندگان
چکیده
We describe algorithms for testing polycyclicity and nilpotency for finitely generated subgroups of GL(d,Q) and thus we show that these properties are decidable. Variations of our algorithm can be used for testing virtual polycyclicity and virtual nilpotency for finitely generated subgroups of GL(d,Q).
منابع مشابه
Applications of Lie Methods to Computations with Polycyclic Groups
In this thesis we demonstrate the algorithmic usefulness of the so-called Mal’cev correspondence for computations with infinite polycyclic groups. This correspondence between Q-powered nilpotent groups and rational nilpotent Lie algebras was discovered by Anatoly Mal’cev in 1951. We show how the Mal’cev correspondence can be realized on a computer. We explore two possibilities for this purpose ...
متن کاملDiagonal Matrix Reduction over Refinement Rings
Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement. Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N if and only if Mm ~Nm for all maximal ideal m of R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...
متن کاملThe Rational Subset Membership Problem for Groups: A Survey
The class of rational subsets of a group G is the smallest class that contains all finite subsets of G and that is closed with respect to union, product and taking the monoid generated by a set. The rational subset membership problem for a finitely generated group G is the decision problem, where for a given rational subset of G and a group element g it is asked whether g ∈ G. This paper presen...
متن کاملRational Codes and Free Profinite Monoids
It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we...
متن کاملInterplay Between the Algebraic Structure of a Group and Arithmetic Properties of its Spectrum
We investigate the inteplay between the algebraic structure of a group G and arithmetic properties of its spectrum σ(G) which consists of the eigenvalues of all the inner automorphisms of G. A complex number λ is called an eigenvalue of a group automorphism A : G → G if φ ◦ A|H = λ · φ for some non-trivial homomorphism φ : H → C defined on an A-invariant subgroup H ⊂ G. It is shown that many pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 76 شماره
صفحات -
تاریخ انتشار 2007